Canonical Forms and Optimal Design of Single Linear Functional Observers

Minimal single linear functional observers for linear systems

A constructive procedure to design a single linear functional observer for a time-invariant linear system is given. The proposed procedure is simple and is not based on the solution of a Sylvester equation or on the use of canonical state space forms. Both stable observers or fixed poles observers problems are considered for minimality.

Canonical forms of Linear Transformations

On canonical forms of ring-linear codes

This work presents an algorithm for the computation of canonical forms of linear codes over arbitrary finite chain rings under the action of the linear isometry group. It is a generalization of a previous work by the author on the canonization of linear codes over finite fields. The algorithm is based on the ideas of partition refinements and it will compute the automorphism group of the code a...

Nearly Optimal Algorithms for Canonical Matrix Forms

A Las Vegas type probabilistic algorithm is presented for nding the Frobenius canonical form of an n n matrix T over any eld K. The algorithm requires O~(MM(n)) = MM(n) (logn) O(1) operations in K, where O(MM(n)) operations in K are suucient to multiply two n n matrices over K. This nearly matches the lower bound of (MM(n)) operations in K for this problem, and improves on the O(n 4) operations...

Design of linear functional observers for linear systems with unknown inputs

In this paper, a straightforward approach is presented to design functional observers for linear systems with unknown inputs. Necessary and sufficient conditions are provided for the existence of the observers. Some illustrated examples are included.